A Hypergraph Representation for Deductive Reasoning Systems
نویسنده
چکیده
Hypergraphs are often used to represent knowledge bases because of their accurate depiction of causal links between facts. Deduction can be computed over such a knowledge base by complete hypergraph traversal. Efficient structuring of such hypergraphs can reduce time in deductive computation as well as space in vertex and hyperedge storage. In this work, we transform a hypergraph storing a knowledge base into a more efficient representation. By representing only part of the ground instantiation of the internal knowledge base, we attain a great space reduction. This partial representation is accomplished by storing non-ground, intensional predicates and by performing individual instantiations on these. In this paper, we present the implementation of these techniques and compare them to those used in computer system INDED (pronounced "indeed").
منابع مشابه
ON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کاملThe Architecture of a Disjunctive Deductive Database System
Disjunctive Deductive Databases (DDDBs) | function-free disjunctive logic programs with negation in rule bodies allowed | have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research has been spent on issues like semantics and complexity of DDDBs, but the important area of implementing DDDBs has been less addressed so far. However, a tho...
متن کاملDeduction and Deductive Databases for Geographic Data Handlingg ?
The representation of complex spatial domains in conventional databases suuers from fragmented representation of object structure , lack of instance-level spatial relationships, and the generation of large combinatoric search spaces in query analysis. The deductive capabilities provided by a deductive database ooer some assistance in solving these problems, in particular by enabling spatial rea...
متن کاملA Deductive System for Non-Monotonic Reasoning
Disjunctive Deductive Databases (DDDBs) | function-free disjunctive logic programs with negation in rule bodies allowed | have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research has been spent on issues like semantics and complexity of DDDBs, but the important area of implementing DDDBs has been less addressed so far. However, a tho...
متن کاملThe Parallelization of a Knowledge Discovery System with Hypergraph Representation
Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDED(pronounced \indeed") is an inductive implementation that performs rule discovery using the techniques of inductive logic programming and accumulates and handles knowledge using a deductive nonmonotonic reasoning engine. We present four schemes...
متن کامل